A Table-filling Scheduling Algorithm for the round Robin Calendar Problem with Arbitrary Competitors

A novel table-filling schedule algorithm is proposed for the round robin calendar problem with arbitrary competitors. Among schedules calendar, the number of rows is the ID of each competitor and elements of the schedule correspond to a certain round serial number of some two competitors. Competition schedule can be completed by the algorithm when the number of competitors is even. If the number of competitors is odd, the schedule will be filled through three steps, even transforming, table filling and even eliminating. It is proved that time and space complexity of the algorithm are all 2 ( ) O n .